Combining Computer Algebra and Rule Based Reasoning
نویسنده
چکیده
We present extended term rewriting systems as a means to describe a simpliication relation for an equational speciication with a built-in domain of external objects. Even if the extended term rewriting system is canonical, the combined relation including built-in computations of`ground terms' needs neither be terminating nor connuent. We investigate restrictions on the extended term rewriting systems and the built-in domains under which these properties hold. A very important property of extended term rewriting systems is decomposition freedom. Among others decomposition free extended term rewriting systems allow for eecient simpliications. Some interesting algebraic applications of canonical simpliication relations are presented.
منابع مشابه
An Executive Approach Based On the Production of Fuzzy Ontology Using the Semantic Web Rule Language Method (SWRL)
Today, the need to deal with ambiguous information in semantic web languages is increasing. Ontology is an important part of the W3C standards for the semantic web, used to define a conceptual standard vocabulary for the exchange of data between systems, the provision of reusable databases, and the facilitation of collaboration across multiple systems. However, classical ontology is not enough ...
متن کاملA Margin-based Model with a Fast Local Searchnewline for Rule Weighting and Reduction in Fuzzynewline Rule-based Classification Systems
Fuzzy Rule-Based Classification Systems (FRBCS) are highly investigated by researchers due to their noise-stability and interpretability. Unfortunately, generating a rule-base which is sufficiently both accurate and interpretable, is a hard process. Rule weighting is one of the approaches to improve the accuracy of a pre-generated rule-base without modifying the original rules. Most of the pro...
متن کاملImproving Accuracy by Combining Rule-based and Case-based Reasoning Improving Accuracy by Combining Rule-based and Case-based Reasoning
An architecture is presented for combining rule-based and case-based reasoning. The architecture is intended for domains that are understood reasonably well, but still imperfectly. It uses a set of rules, which are taken to be only approximately correct, to obtain a preliminary answer for a given problem; it then draws analogies from cases to handle exceptions to the rules. Having rules togethe...
متن کاملImproving Agent Performance for Multi-Resource Negotiation Using Learning Automata and Case-Based Reasoning
In electronic commerce markets, agents often should acquire multiple resources to fulfil a high-level task. In order to attain such resources they need to compete with each other. In multi-agent environments, in which competition is involved, negotiation would be an interaction between agents in order to reach an agreement on resource allocation and to be coordinated with each other. In recent ...
متن کاملA Global Workspace Framework for Combining Reasoning Systems
Stand-alone Artificial Intelligence systems for performing specific types of reasoning – such as automated theorem proving and symbolic manipulation in computer algebra systems – are numerous, highly capable and constantly improving. Moreover, systems which combine various forms of reasoning have repeatedly been shown to be more effective than stand-alone systems. For example, the ICARUS system...
متن کامل